The inuence of Miroslav Fiedler on spectral graph theory

نویسندگان

  • V. Nikiforov
  • Miroslav Fiedler
چکیده

This note is a write up of a talk given at the ILAS meeting in Braunschweig, 2011, at the minisymposium celebrating the 80th birthday of Miroslav Fiedler. The purpose of the talk is to outline the impact of Fiedler’s work on the development of spectral graph theory. Fiedler is best known for putting forward the algebraic connectivity and its eigenvector. These two topics were genuine gold strikes which have motivated thousands of studies in pure and applied science. But there is more in Fiedler’s work that in‡uences spectral graph theory, and still more waiting to be discovered. Keywords: algebraic connectivity, Fiedler vector, elliptic matrix, additive compound matrix. AMS classi…cation: 05C50, 05C35 About gold strikes in mathematics In mathematics, as in life, there are people that can strike gold. When real gold has been struck, we can see that, as inevitably a gold rush follows. Since the times of Euclid there have been numerous golds strikes in mathematics, but here are two more recent examples that caused memorable rushes: the semi-circle law of Wigner from 1955 about the distribution of eigenvalues of random real symmetric matrices and the regularity lemma of Szemerédi from 1978 about the structure of large graphs. Thus, when we use here “gold in mathematics”this is not about monumental theories but about short and sharp assertions that can attract people to follow overnight. Unfortunately, in mathematics gold is struck as seldom as in life, and few are the lucky ones that are able to do it. This ability is indeed uncanny, it is not the skill or even imagination that matters, one truly needs prospector’s eyes and hunch. Today we are speaking about the work of Miroslav Fiedler, a mathematician who struck gold on more than one occasion. His brilliant contributions to matrix theory, geometry, numerical methods Department of Mathematical Sciences, University of Memphis, Memphis TN 38152, USA; email: [email protected] yResearch supported by NSF Grant DMS-0906634.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Matrices and graphs in Euclidean geometry

Some examples of the interplay between matrix theory, graph theory and n-dimensional Euclidean geometry are presented. In particular, qualitative properties of interior angles in simplices are completely characterized. For right simplices, a relationship between the tree of legs and the circumscribed Steiner ellipsoids is proved.

متن کامل

Invertibility of graph translation and support of Laplacian Fiedler vectors

The graph Laplacian operator is widely studied in spectral graph theory largely due to its importance in modern data analysis. Recently, the Fourier transform and other time-frequency operators have been defined on graphs using Laplacian eigenvalues and eigenvectors. We extend these results and prove that the translation operator to the i’th node is invertible if and only if all eigenvectors ar...

متن کامل

Sufficient Spectral Conditions for Hamiltonicity

The question of deciding whether or not a given graph is Hamiltonian is a very difficult one; indeed, determining whether a given graph is Hamiltonian is NP-complete. Here, we discuss applications of spectral graph theory to this problem. In particular, we explore results by Fiedler and Nikiforov [2] regarding spectral conditions on the adjacency matrix to ensure Hamiltonicity, and results by B...

متن کامل

Fiedler Vectors and Elongation of Graphs: A Threshold Phenomenon on a Particular Class of Trees

Let G be a graph. Its laplacian matrix L(G) is positive and we consider eigenvectors of its first non-null eigenvalue that are called Fiedler vector. They have been intensively used in spectral partitioning problems due to their good empirical properties. More recently Fiedler vectors have been also popularized in the computer graphics community to describe elongation of shapes. In more technic...

متن کامل

Semi-supervised Spectral Clustering for Classification

We propose a Classification Via Clustering (CVC) algorithm which enables existing clustering methods to be efficiently employed in classification problems. In CVC, training and test data are coclustered and class-cluster distributions are used to find the label of the test data. To determine an efficient number of clusters, a Semi-supervised Hierarchical Clustering (SHC) algorithm is proposed. ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014